1
کامپیوتر و شبکه::
گراف مدور
Based on the mechanism of communication pipeline, it can be applied to both acyclic and cyclic graphs.
However, for acyclic graphs, communication pipeline can be used as much as possible, while for cyclic graphs, the usage of communi- cation pipeline is limited by the number of delayed iterations in the task loop to avoid deadlock [6].
We aim to map a directed cyclic graph onto a 2-CPU platform as shown in Fig. 3 and its task execution time and communication time before mapping is shown beside the node and the edge (italic) of the graph.
Therefore, while load balance and communication pipeline allocation can be obtained simultaneously for acyclic graphs, the two factors re- quire a tradeoff for cyclic graphs.
For cyclic graphs, the
واژگان شبکه مترجمین ایران